1008A - Romaji - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;

typedef  long long int   ll;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll test,h,p,i,j,s,xy,n,flag=0,u,count,d,o1=0,o2=0,e,l,r,x,y,m,z,max1,x1,y1,k,x2,y2,z1,z2,sum,min1;
string a;
cin>>a;
n=a.size();
a.push_back('*');
map<char,ll>mk;
mk['i']=1;
mk['u']=1;
mk['o']=1;
mk['e']=1;
mk['a']=1;
for(i=0;i<n;i++){
    if(mk.find(a[i])==mk.end()&&a[i]!='n'){
        if(mk.find(a[i+1])==mk.end()){
            cout<<"NO\n";
            return 0;
        }
    }
}
cout<<"YES\n";

return 0;
}